FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
نویسندگان
چکیده
منابع مشابه
Flowshop Schedules with Sequence Dependent Setup Times
The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...
متن کاملA Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملMinimizing Total Tardiness in a Hybrid Flexible Flowshop with Sequence Dependent Setup Times
In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...
متن کاملIntegrative Cooperative Approach for Solving Permutation Flowshop Scheduling Problem with Sequence Dependent Family Setup Times
This paper addresses to the permutation flowline manufacturing cell with sequence dependent family setup times problem. The objective is to minimize the makespan criterion. We propose a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance the current solution. Moreover, the ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1986
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.29.206